Towards Provably Correct Code Gneration for a Hard Real-Time Programming Language
نویسندگان
چکیده
This paper sketches a hard real-time programming language featuring operators for expressing timeliness requirements in an abstract, implementation-independent way and presents parts of the design and veriication of a provably correct code generator for that language. The notion of implementation correctness used as an implicit speciication of the code generator pays attention to timeliness requirements. Hence, formal veriication of the code generator design is a guarantee of meeting all deadlines when executing generated code.
منابع مشابه
Compilation and Synthesis for Real-Time Embedded Controllers
This article provides an overview over two constructive approaches to provably correct hard real-time code generation where hard real-time code is generated from abstract requirements rather than verified against the timing requirements a posteriori. The first, more pragmatic approach is concerned with translation of imperative programs, extended by hard real-time commands which allow one to sp...
متن کاملTowards Provably Correct Code Generation via Horn Logical Continuation Semantics
Provably correct compilation is an important aspect in development of high assurance software systems. In this paper we explore approaches to provably correct code generation based on programming language semantics, particularly Horn logical semantics, and partial evaluation. We show that the definite clause grammar (DCG) notation can be used for specifying both the syntax and semantics of impe...
متن کاملProvably Correct Code Generation: A Case Study
Provably correct compilation is an important aspect in development of high assurance software systems. In this paper we present an approach to provably correct compilation based on Horn logical semantics of programming languages and partial evaluation. We also show that continuation semantics can be expressed in the Horn logical framework, and introduce Definite Clause Semantics. We illustrate ...
متن کاملE-SPARK: Automated Generation of Provably Correct Code from Formally Verified Designs
An approach to generating provably correct sequential code from formally developed algorithmic designs is presented. Given an algorithm modelled in the Event-B formalism, we automatically translate the design into the SPARK programming language. Our translation builds upon Abrial’s approach to the development of sequential programs from Event-B models. However, as well as generating code, our a...
متن کاملA Provably Correct Complier Generator
We have designed, implemented, and proved the correctness of a compiler generator that accepts action semantic descriptions of imperative programming languages. The generated compilers emit absolute code for an abstract RISC machine language that currently is assembled into code for the SPARC and the HP Precision Architecture. Our machine language needs no run-time type-checking and is thus mor...
متن کامل